منابع مشابه
Structural Decomposition Trees
Researchers and analysts in modern industrial and academic environments are faced with a daunting amount of multi-dimensional data. While there has been significant development in the areas of data mining and knowledge discovery, there is still the need for improved visualizations and generic solutions. The state-of-the-art in visual analytics and exploratory data visualization is to incorporat...
متن کاملStructural Decomposition Trees: Semantic and Practical Implications
The visualization of high-dimensional data is a challenging research topic. Existing approaches can usually be assigned to either relation or value visualizations. Merging approaches from both classes into a single integrated strategy, Structural Decomposition Trees (SDTs) represent a completely novel visualization approach for high-dimensional data. Although this method is new and promising, s...
متن کاملFirst-order Decomposition Trees
Lifting attempts to speedup probabilistic inference by exploiting symmetries in the model. Exact lifted inference methods, like their propositional counterparts, work by recursively decomposing the model and the problem. In the propositional case, there exist formal structures, such as decomposition trees (dtrees), that represent such a decomposition and allow us to determine the complexity of ...
متن کاملStructural decomposition
In this report we present an algorithm for the decomposition of a mono-lithic LOTOS process into two processes, which composed by the parallel operator is observational equivalent to the original one. Repeated application permits the generation of more than two processes. The algorithm is deened on labelled transition systems and, hence, its application to any process algebra with a similar not...
متن کاملFactored Planning using Decomposition Trees
Improving AI planning algorithms relies on the ability to exploit the structure of the problem at hand. A promising direction is that of factored planning, where the domain is partitioned into subdomains with as little interaction as possible. Recent work in this field has led to an detailed theoretical analysis of such approaches and to a couple of high level planning algorithms, but with no p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2011
ISSN: 0167-7055
DOI: 10.1111/j.1467-8659.2011.01941.x